Weighted Spanning Trees on some Self-Similar Graphs
نویسندگان
چکیده
We compute the complexity of two infinite families of finite graphs: the Sierpiński graphs, which are finite approximations of the well-known Sierpiński gasket, and the Schreier graphs of the Hanoi Towers group H(3) acting on the rooted ternary tree. For both of them, we study the weighted generating functions of the spanning trees, associated with several natural labellings of the edge sets.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملUniform spanning trees on Sierpiński graphs
We study spanning trees on Sierpiński graphs (i.e., finite approximations to the Sierpiński gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpiński graph and show that this construction gives rise to a multi-type Galton-Watson tree. We derive a number of structural results, for instance on the degree distribution....
متن کاملThe Number of Spanning Trees in Self-similar Graphs
The number of spanning trees of a graph, also known as the complexity, is investigated for graphs which are constructed by a replacement procedure yielding a self-similar structure. It is shown that exact formulæ for the number of spanning trees can be given for sequences of self-similar graphs under certain symmetry conditions. These formulæ exhibit interesting connections to the theory of ele...
متن کاملRanking and ordering problems of spanning trees
Each spanning tree T of an undirected graph G = (V,E) is represented by a vertex in the tree graph ofG. Two of these ‘spanning tree’ vertices are connected by an edge if and only if the corresponding spanning trees are related by an edge swap. This definition can also be extended to undirected weighted graphs G = (V,E, w) and weighted spanning trees. A couple of questions have arisen regarding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011